One-Dimension Multi-Objective Bin Packing Problem using Memetic Algorithm
نویسندگان
چکیده
Abstract— Memetic Algorithm has been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for One-dimension Multi-Objective Bin Packing Problem. Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. In this paper memetic algorithm is performing local search on each chromosome; it is guaranteed to give near to optimal solution than Genetic Algorithm. Keywords— One-dimension Multi-Objective Bin Packing Problem (ODMOBPP); Memetic Algorithm; Local Search; Optimization problems
منابع مشابه
On solving multi-objective bin packing problems using memetic algorithms
The bin-packing problem (BPP) and its multi-dimensional variants have many practical applications, such as packing objects in boxes, production planning, multiprocessor scheduling, etc. The classical singleobjective formulation of the two-dimensional bin packing (2D-BPP) consists of packing a set of objects (pieces) in the minimum number of bins (containers). This paper presents a new Pareto-ba...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملParallel Hyperheuristics for a MultiObjectivised 2D Packing Problem
Bin Packing Problems are combinatorial NP-hard problems in which objects with different shapes must be packed into a finite number of bins. They have many practical applications as filling up containers. In this work, the 2D Bin Packing Problem (2DPP) proposed in the Genetic and Evolutionary Computation Conference 2008 has been considered. The best results for the 2DPP contest instance were obt...
متن کاملMulti objective optimization of heterogeneous bin packaging using adaptive genetic approach
Objectives: The packing of goods in any industry is a tedious work. The proposed system evaluates the optimal packing and prediction of 3D bin packing maximize the maximize profit. Methods/Statistical Analysis: The Adaptive Genetic Algorithm (AGA) is used to solve the 3D single bin packing problem by getting the user input data such as number of bins, its size, shape, weight, and constraints if...
متن کامل